Bounds for the MSE Performance of ConstantModulus
نویسنده
چکیده
The constant modulus (CM) criterion has become popular in the design of blind linear estimators of sub-Gaussian i.i.d. processes transmitted through unknown linear channels in the presence of unknown additive interference. In this paper, we present an upper bound for the conditionally unbiased mean-squared error (UMSE) of CM-minimizing estimators that depends only on the source kurtoses and the UMSE of Wiener estimators. Further analysis reveals that the extra UMSE of CM estimators can be upper bounded by approximately the square of the Wiener (i.e., minimum) UMSE. Since our results hold for vector-valued FIR/IIR linear channels, vector-valued FIR/IIR estimators with a possibly constrained number of adjustable parameters, and multiple interfers with arbitrary distribution, they connrm the longstanding conjecture regarding the general MSE-robustness of CM estimators.
منابع مشابه
Classes of lower bounds on outage error probability and MSE in Bayesian parameter estimation
In this paper, new classes of lower bounds on the outage error probability and on the mean-square-error (MSE) in Bayesian parameter estimation are proposed. The minima of the h-outage error probability and the MSE are obtained by the generalized maximum a-posteriori probability and the minimum MSE (MMSE) estimators, respectively. However, computation of these estimators and their corresponding ...
متن کاملMSE Bounds With Affine Bias Dominating the CramÉr-Rao Bound
In continuation to an earlier work, we further develop bounds on the mean-squared error (MSE) when estimating a deterministic parameter vector 0 in a given estimation problem, as well as estimators that achieve the optimal performance. The traditional Cramér–Rao (CR) type bounds provide benchmarks on the variance of any estimator of 0 under suitable regularity conditions, while requiring a prio...
متن کاملAnalysis of Performance of Linear Analog Codes
In this paper we carefully study the MSE performance of the linear analog codes. We have derived a lower bound of the MSE performance under Likelihood(ML) and Linear Minimal Mean Square Error(LMMSE) decoding criteria respectively. It is proved in this essay that a kind of linear analog codes called unitary codes can simultaneously achieve both of these two bounds. At the same time, we compare t...
متن کاملCramer Rao-Type Bounds for Sparse Bayesian Learning
In this paper, we derive Hybrid, Bayesian and Marginalized Cramér-Rao lower bounds (HCRB, BCRB and MCRB) for the single and multiple measurement vector Sparse Bayesian Learning (SBL) problem of estimating compressible vectors and their prior distribution parameters. We assume the unknown vector to be drawn from a compressible Student-t prior distribution. We derive CRBs that encompass the deter...
متن کاملLower bounds on scintillation detector timing performance
Fundamental method-independent linuts on the timing performance of scintillation detectors are useful for identifying regimes in which either present timing methods are nearly optimal or where a considerable performance gain might be realized using better pulse processing techniques . Several types of lower bounds on mean-squared timing error (MSE) performance have been developed and applied to...
متن کامل